Query Learning with Large Margin Classi ersColin
نویسندگان
چکیده
The active selection of instances can sig-niicantly improve the generalisation performance of a learning machine. Large margin classiiers such as support vector machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance selection strategies. In this paper we propose an algorithm for the training of support vector machines using instance selection. We give a theoretical justiication for the strategy and experimental results on real and ar-tiicial data demonstrating its eeectiveness. The technique is most eecient when the data set can be learnt using few support vectors.
منابع مشابه
Bounds for Voting Classi ers Using Margin Cost Functions
| Recent theoretical results have shown that the accuracy of thresholded real-valued functions (such as voting classi ers) is greatly improved if the underlying function has large margins on the training data (that is, correct examples are classi ed well away from the decision boundary). In this paper, we give bounds on the misclassi cation probability of convex combinations of classi ers in te...
متن کاملRegression Models for Ordinal Data : AMachine Learning
In contrast to the standard machine learning tasks of classi cation and metric regression we investigate the problem of predicting variables of ordinal scale, a setting referred to as ordinal regression. The task of ordinal regression arises frequently in the social sciences and in information retrieval where human preferences play a major role. Also many multi{class problems are really problem...
متن کاملA Pac{bayesian Study of Linear Classiiers: Why Svms Work
In this paper we present a bound on the generalisation error of linear classi ers in terms of a re ned margin quantity on the training set. The result is obtained by a fundamentally di erent reasoning than in the classical PAC framework. We show that the generalisation error of a classi er can be bounded purely by geometrical arguments. In contrast to the classical results our bound does not co...
متن کاملThe Rademacher Complexity of Linear Transformation Classes
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a nite dimensional space. The results imply generalization guarantees for graph regularization and multi-task subspace learning. 1 Introduction Rademacher averages have been introduced to learning theory as an e¢ cient complexity measure for function classes, mot...
متن کاملLearning to Compare using Operator-Valued Large-Margin Classi ers
The proposed method uses homonymous and heteronymous examplepairs to train a linear preprocessor on a kernel-induced Hilbert space. The algorithm seeks to optimize the expected performance of elementary classi ers to be generated from single future training examples. The method is justi ed by PAC-style generalization guarantees and the resulting algorithm has been tested on problems of geometri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000